Remark on Polyhedral Cones a Remark on Polyhedral Cones from Packed Words and from Finite Topologies Darij Grinberg

نویسنده

  • Darij Grinberg
چکیده

Definition 0.2. For any two sets X and Y, let Map (X, Y) denote the set of all maps from X to Y. Define a K-vector space M by M = ⊕ n≥0 Map (Rn, K) (where each Map (Rn, K) becomes a K-vector space by pointwise addition and multiplication with scalars). We make M into a K-algebra, whose multiplication is defined as follows: For any n ∈ N, any m ∈ N, any f ∈ Map (Rn, K) and g ∈ Map (Rm, K), we define f g to be the element of Map (Rn+m, K) which sends every (x1, x2, . . . , xn+m) ∈ Rn+m to f (x1, x2, . . . , xn) g (xn+1, xn+2, . . . , xn+m).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polyhedral Combinatorics of UPGMA Cones

Distance-based methods such as UPGMA (Unweighted Pair Group Method with Arithmetic Mean) continue to play a significant role in phylogenetic research. We use polyhedral combinatorics to analyze the natural subdivision of the positive orthant induced by classifying the input vectors according to tree topologies returned by the algorithm. The partition lattice informs the study of UPGMA trees. We...

متن کامل

Angular analysis of two classes of non - polyhedral convex cones : the point of view of optimization theory ∗

There are three related concepts that arise in connection with the angular analysis of a convex cone: antipodality, criticality, and Nash equilibria. These concepts are geometric in nature but they can also be approached from the perspective of optimization theory. A detailed angular analysis of polyhedral convex cones has been carried out in a recent work of ours. This note focus on two import...

متن کامل

Scalarizations for Maximization with Respect to Polyhedral Cones

Efficient points are obtained for cone-ordered maximizations in n R using the method of scalarization. Various scalarizations are presented for ordering cones in general and then for the important special case of polyhedral cones. For polyhedral cones, it is shown how to find vectors in the positive dual cone that are needed for a scalarized objective function. Instructive examples are presented.

متن کامل

Normally admissible stratifications and calculation of normal cones to a finite union of polyhedral sets

This paper considers computation of Fréchet and limiting normal cones to a finite union of polyhedra. To this aim, we introduce a new concept of normally admissible stratification which is convenient for calculations of such cones and provide its basic properties. We further derive formulas for the above mentioned cones and compare our approach to those already known in the literature. Finally,...

متن کامل

Small cones of m-hemimetrics

We introduce polyhedral cones associated with m-hemimetrics on n points, and, in particular, with m-hemimetrics coming from partitions of an n-set into m + 1 blocks. We compute generators and facets of the cones for small values of m, n and study their skeleton graphs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015